Towards a Proof Theory for Basic Logic
نویسنده
چکیده
Proof systems based on rules with the property that all formulas contained in the assumptions are contained as subformulas in the conclusion as well, are particularly suitable for automated proof search. Systems of this kind were found for several well-known fuzzy logics. However, for BL (Basic Logic), the logic of continuous t-norms and their residua, the situation is less satisfactory. We consider two proof systems for BL which fulfill the desired property in quite contrasting ways.
منابع مشابه
Truth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملTowards a Proof Theory of Gödel Modal Logics
Analytic proof calculi are introduced for box and diamond fragments of basic modal fuzzy logics that combine the Kripke semantics of modal logic K with the manyvalued semantics of Gödel logic. The calculi are used to establish completeness and complexity results for these fragments.
متن کاملTowards a Logic for Reasoning About Logic Programs Transformation
We give a proof-theoretic analysis of logic programs transformations , viewed as operations on proof trees in the sense of 3, 4, 9, 10]. We present a logic for reasoning about (equivalence preserving) transformations of logic programs. Our main tool is the usage of inference rules; the target program may be obtained as a set of clause introduction proofs with axioms from the source program. The...
متن کاملTowards a Proof Theory for Multi-Agent Logics with Irrevocable Strategies
Logics such as Alternating-time Temporal Logic (ATL) enable us to reason about the strategic abilities of agents. However, strategies in the semantics of ATL are, in a certain precise sense, revocable. On the other hand, irrevocable strategies are often naturally assumed, e.g., in game theory. In a recent work [1] we have introduced versions of ATL employing irrevocable strategies. This abstrac...
متن کاملTowards certification of TLA+ proof obligations with SMT solvers
TLA+ is a formal specification language that is based on Zermelo-Fränkel set theory and the Temporal Logic of Actions TLA. The TLA+ proof system TLAPS assists users in deductively verifying safety properties of TLA+ specifications. TLAPS is built around a proof manager, which interprets the TLA+ proof language, generates corresponding proof obligations, and passes them to backend verifiers. In ...
متن کامل